Multiagent Decision by Partial Evaluation

نویسندگان

  • Yang Xiang
  • Franklin Hanshar
چکیده

We consider multiagent cooperative decision in stochastic environments, and focus on online decision during which agents communicate. We generalize partial evaluation from a specific application to a class of collaborative decision networks (CDNs), and propose a distributed decision algorithm based on partial evaluation. We show that when agents have private decision variables, the new algorithm can significantly speed up decision in comparison with the earlier CDN algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiagent Decision Making in Collaborative Decision Networks by Utility Cluster Based Partial Evaluation

We consider optimal multiagent cooperative decision making in stochastic environments. The focus is on simultaneous decision making, during which agents cooperate by limited communication. We model the multiagent system as a collaborative decision network (CDN). Several techniques are developed to improve efficiency for decision making with CDNs. We present an equivalent transformation of CDN s...

متن کامل

Improved use of partial policies for identifying behavioral equivalence

Interactive multiagent decision making often requires to predict actions of other agents by solving their behavioral models from the perspective of the modeling agent. Unfortunately, the general space of models in the absence of constraining assumptions tends to be very large thereby making multiagent decision making intractable. One approach that can reduce the model space is to cluster behavi...

متن کامل

Asynchronous Execution in Multiagent POMDPs: Reasoning over Partially-Observable Events

This paper proposes a novel modeling approach to problems of multiagent decision-making under partial observability, building on the framework of Multiagent Partial Observable Markov Decision Processes (MPOMDPs). Unfortunately, the size of MPOMDP models (and their solutions) grows exponentially in the number of agents, and agents are required to act in synchrony. In the present work, we show ho...

متن کامل

A Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem

Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...

متن کامل

Graphical Multiagent Decision Model: Towards Adaptability

Multiagent decision making is a typical decision problem in the changing world. We propose a new framework, including multiply sectioned influence diagrams (MSID) and hyper relevance graph (HRG), to represent this large and complex decision problem involving multiple agents. An MSID is an agency graphical language for representing decision problems in a distributed fashion while an HRG expresse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012